Reduced Complexity HMM Filtering With Stochastic Dominance Bounds: A Convex Optimization Approach
نویسندگان
چکیده
منابع مشابه
Local Minimax Complexity of Stochastic Convex Optimization
We extend the traditional worst-case, minimax analysis of stochastic convex optimization by introducing a localized form of minimax complexity for individual functions. Our main result gives function-specific lower and upper bounds on the number of stochastic subgradient evaluations needed to optimize either the function or its “hardest local alternative” to a given numerical precision. The bou...
متن کاملLower Bounds for Convex Optimization with Stochastic Oracles
We first formalize stochastic optimization in the oracle-versus-optimizer paradigm (Nemirovski and Yudin, 1983) in Section 1, and then sketch the state-of-the-art upper and lower bounds for the rate of convergence (Agarwal et al., 2009) in Section 2. Intuitively, they show that there exists a firstorder stochastic oracle (which returns a noisy version of the gradient with zero mean and bounded ...
متن کاملOptimization with Stochastic Dominance Constraints
We introduce stochastic optimization problems involving stochastic dominance constraints. We develop necessary and sufficient conditions of optimality and duality theory for these models and show that the Lagrange multipliers corresponding to dominance constraints are concave nondecreasing utility functions. The models and results are illustrated on a portfolio optimization problem.
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملA note on convex stochastic dominance
In this paper, we extend Fishburn’s convex stochastic dominance theorem to include any distribution function. This paper also considers risk takers as well as risk averters, and discusses third order stochastic dominance. We apply separation and representation theorems to obtain a concise alternative proof of the theorem. Our results are used to extend a theorem of Bawa et.al. on comparison bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2014.2362886